A Fibrational Semantics for Logic Programs
نویسندگان
چکیده
We introduce a new semantics for logic programming languages. It generalises the traditional Herbrand universe semantics, and specialises the semantics of logical relations, as used in analysing parametricity in functional and imperative programming languages. We outline a typed logic programming language, give it this semantics, and show how it supports structured development of logic programs as advocated by Sterling et al. In particular, it gives semantics for some dynamic aspects of logic programs.
منابع مشابه
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational se mantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our ...
متن کاملFLP Semantics Without Circular Justifications for General Logic Programs
The FLP semantics presented by (Faber, Leone, and Pfeifer 2004) has been widely used to define answer sets, called FLP answer sets, for different types of logic programs such as logic programs with aggregates, description logic programs (dl-programs), Hex programs, and logic programs with first-order formulas (general logic programs). However, it was recently observed that the FLP semantics may...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملA Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms
Logic programs with abstract constraint atoms proposed by Marek and Truszczynski are very general logic programs. They are general enough to capture aggregate logic programs as well as recently proposed description logic programs. In this paper, we propose a wellfounded semantics for basic logic programs with arbitrary abstract constraint atoms, which are sets of rules whose heads have exactly ...
متن کامل